A facial reduction algorithm for finding sparse SOS representations
نویسندگان
چکیده
منابع مشابه
A facial reduction algorithm for finding sparse SOS representations
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for an SOS representation. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.
متن کاملBayesian methods for finding sparse representations
OF THE DISSERTATION Bayesian Methods for Finding Sparse Representations
متن کاملA bilinear algorithm for sparse representations
We consider the following sparse representation problem: represent a given matrix X ∈ IRm×N as a multiplication X = AS of two matrices A ∈ IRm×n (m 6 n < N) and S ∈ IRn×N , under requirements that all m×m submatrices of A are nonsingular, and S is sparse in sense that each column of S has at least n −m + 1 zero elements. It is known that under some mild additional assumptions, such representati...
متن کاملSemidefinite Representations and Facial Reduction
In this paper we extend a recent algorithm for solving the sensor network localization problem (SNL ) to include instances with facial reduction to include the intersection of more than two faces. In particular, we continue to exploit the implicit degeneracy in the semidefinite programming (SDP ) relaxation of SNL . This is a preliminary working paper, and is a work in progress.
متن کاملAn Efficient Algorithm for Sparse Representations
Basis Pursuit (BP) and Basis Pursuit Denoising (BPDN), well established techniques for computing sparse representations, minimize an ` data fidelity term, subject to an ` sparsity constraint or regularization term, by mapping the problem to a linear or quadratic program. BPDN with an ` data fidelity term has recently been proposed, also implemented via a mapping to a linear program. We introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2010
ISSN: 0167-6377
DOI: 10.1016/j.orl.2010.05.011